A note on envy-free cake cutting with polynomial valuations
نویسنده
چکیده
Article history: Received 20 May 2013 Received in revised form 7 July 2014 Accepted 9 July 2014 Available online xxxx Communicated by B. Doerr
منابع مشابه
How to Cut a Cake Before the Party Ends
For decades researchers have struggled with the problem of envy-free cake cutting: how to divide a divisible good between multiple agents so that each agent likes his own allocation best. Although an envy-free cake cutting protocol was ultimately devised, it is unbounded, in the sense that the number of operations can be arbitrarily large, depending on the preferences of the agents. We ask whet...
متن کاملCake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
Cake cutting is one of the most fundamental settings in fair division and mechanism design without money. In this paper, we consider different levels of three fundamental goals in cake cutting: fairness, Pareto optimality, and strategyproofness. In particular, we present robust versions of envy-freeness and proportionality that are not only stronger than their standard counter-parts but also ha...
متن کاملOn the Complexity of Envy-Free Cake Cutting
We study the envy-free cake-cutting problem for d+1 players with d cuts, for both the oracle function model and the polynomial time function model. For the former, we derive a θ(( ǫ )) time matching bound for the query complexity of d + 1 player cake cutting with Lipschitz utilities for any d > 1. When the utility functions are given by a polynomial time algorithm, we prove the problem to be PP...
متن کاملAlgorithmic Solutions for Envy-Free Cake Cutting
We study the problem of finding an envy-free allocation of a cake to d+1 players using d cuts. Two models are considered, namely, the oracle-function model and the polynomial-time function model. In the oracle-function model, we are interested in the number of times an algorithm has to query the players about their preferences to find an allocation with the envy less than . We derive a matchin...
متن کاملMeta-envy-free Cake-cutting and Pie-cutting Protocols
This paper discusses cake-cutting protocols when the cake is a heterogeneous good, represented by an interval on the real line. We propose a new desirable property, the meta-envy-freeness of cake-cutting, which has not been formally considered before. Meta-envy-free means there is no envy on role assignments, that is, no party wants to exchange his/her role in the protocol with the one of any o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 115 شماره
صفحات -
تاریخ انتشار 2015